Formulate All

Objective

Confidence: 5/5
Maximize ∑i=1NValues[i]×X[i]\text{Maximize } \sum_{i=1}^{N} \text{Values}[i] \times X[i]

Constraints

Confidence: 5/5
∑i=1NWeightsi⋅Xi≤MaxCapacity\sum_{i=1}^{N} Weights_i \cdot X_i \leq MaxCapacity
Confidence: 5/5
Xi≥0,∀i∈{1,2,…,N}X_i \geq 0, \quad \forall i \in \{1, 2, \ldots, N\}
Confidence: 5/5
∑i=1NWeightsi⋅Xi≤MaxCapacity\sum_{i=1}^{N} \text{Weights}_i \cdot X_i \leq \text{MaxCapacity}

Variables

SymbolShapeDefinitionDomain

Common Problem Type Detected

It seems like your problem is an instance of Knapsack Problem. Consider using one of the relevant specific-purpose solvers instead of OptiMUS.


The problem involves selecting items with specific weights and values to maximize the total value without exceeding a weight limit of 15 kg. This precisely fits the definition of the Knapsack Problem, where the objective is to choose the most valuable combination of items within a given weight constraint.